翻訳と辞書 Words near each other ・ Klein Windhoek ・ Klein Wittensee ・ Klein Zecher ・ Kleeer ・ Kleefeld, Manitoba ・ Kleemann ・ Kleemenko cycle ・ Kleemu ・ Kleena Kleene ・ Kleene algebra ・ Kleene award ・ Kleene fixed-point theorem ・ Kleene star ・ Kleene's algorithm ・ Kleene's O ・ Kleene's recursion theorem ・ Kleene's T predicate ・ Kleenex ・ Kleenex Girl Wonder ・ Kleenex/LiLiPUT ・ Kleeneze ・ Kleene–Brouwer order ・ Kleene–Rosser paradox ・ Kleenheat Gas ・ Kleenmaid ・ KleenSpeed Technologies ・ Kleercut ・ Kleerup ・ Kleerup (album) ・ Kleetope Dictionary Lists mini英和辞書 mini和英辞書 Webster 1913 Latin-English FOLDOC Wikipedia English ウィキペディア

翻訳と辞書　辞書検索 [ 開発暫定版 ] スポンサード リンク Kleene's recursion theorem ： ウィキペディア英語版 Kleene's recursion theorem In computability theory, Kleene's recursion theorems are a pair of fundamental results about the application of computable functions to their own descriptions. The theorems were first proved by Stephen Kleene in 1938 and appear in his 1952 book ''Introduction to Metamathematics''. The two recursion theorems can be applied to construct fixed points of certain operations on computable functions, to generate quines, and to construct functions defined via recursive definitions. The application to construction of a fixed point of any computable function is known as Rogers' theorem and is due to Hartley Rogers, Jr. (Rogers, 1967). == Notation == The statement of the theorems refers to an admissible numbering $\backslash varphi$ of the partial recursive functions, such that the function corresponding to index $e$ is $\backslash varphi\_e$. In programming terms, $e$ is the program and $\backslash varphi\_e$ its semantic denotation. 抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』 ■ウィキペディアで「Kleene's recursion theorem」の詳細全文を読む スポンサード リンク 翻訳と辞書 : 翻訳のためのインターネットリソース Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.